Recent Complexity Results on Generation Problems
نویسنده
چکیده
Generation problems are the problems of enumerating all configurations that satisfy a given specification. Our research is focused on the generation of all maximal satisfying truth assignments of arbitrary Boolean expressions in Conjunctive Normal Form, a generalization of the well-known transversal hypergraph problem, that is, the problem of generating all minimal hitting sets (transversals) of a hypergraph. The above problem turn out to be central in various areas of Computer Science. We study the computational complexity of these problems and give some resent results. Recent Complexity Results on Generation Problems Elias C. Stavropoulos University of Patras Computer Engineering & Informatics Department GR-265 00 Rio, Patras, Greece URL: http://www.ceid.upatras.gr/∼estavrop
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملAn Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملOn the complexity of column generation in survivable network design with path-based survivability mechanisms
This paper deals with path-based linear programming formulations in survivable network design. In a recent survey we have investigated the complexity of the column generation problems for a large variety of protection and restoration mechanisms in a single or multiple link failure scenario, and classified them according to their structure. It turned out that all the considered column generation...
متن کاملCombined Use of Sensitivity Analysis and Hybrid Wavelet-PSO- ANFIS to Improve Dynamic Performance of DFIG-Based Wind Generation
In the past few decades, increasing growth of wind power plants causes different problems for the power quality in the grid. Normal and transient impacts of these units on the power grid clearly indicate the need to improve the quality of the electricity generated by them in the design of such systems. Improving the efficiency of the large-scale wind system is dependent on the control parameter...
متن کاملGeneration as Dependency Parsing
Natural-Language Generation from flat semantics is an NP-complete problem. This makes it necessary to develop algorithms that run with reasonable efficiency in practice despite the high worstcase complexity. We show how to convert TAG generation problems into dependency parsing problems, which is useful because optimizations in recent dependency parsers based on constraint programming tackle ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002